Cyclic 4-Colorings of Graphs on Surfaces

نویسندگان

  • Atsuhiro Nakamoto
  • Kenta Noguchi
  • Kenta Ozeki
چکیده

To attack the Four Color Problem, in 1880, Tait gave a necessary and sufficient condition for plane triangulations to have a proper 4-vertex-coloring: a plane triangulation G has a proper 4-vertex-coloring if and only if the dual of G has a proper 3-edge-coloring. A cyclic coloring of a map G on a surface F 2 is a vertex-coloring of G such that any two vertices x and y receive different colors if x and y are incident with a common face of G. In this paper, we extend the result by Tait to two directions, that is, considering maps on a non-spherical surface and cyclic 4-colorings.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perfect $2$-colorings of the Platonic graphs

In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and  the icosahedral graph.

متن کامل

Compact cyclic edge-colorings of graphs

The paper is devoted to the model of compact cyclic edge-coloring. This variant of edge-coloring finds its applications in modeling schedules in production systems, in which production proceeds in a cyclic way. We point out optimal colorings for some graph classes and we construct graphs which cannot be colored in a compact cyclic manner. Moreover, we prove some theoretical properties of consid...

متن کامل

Neighbor-distinguishing k-tuple edge-colorings of graphs

This paper studies proper k-tuple edge-colorings of graphs that distinguish neighboring vertices by their sets of colors. Minimum number of colors for such colorings are determined for cycles, complete graphs and complete bipartite graphs. A variation in which the color sets assigned to edges have to form cyclic intervals is also studied and similar results are given.

متن کامل

Interval cyclic edge-colorings of graphs

A proper edge-coloring of a graph G with colors 1, , t  is called an interval cyclic t  coloring if all colors are used, and the edges incident to each vertex ( ) v V G  are colored with ( ) G d v consecutive colors by modulo t , where ( ) G d v is the degree of the vertex v in G . In this paper some properties of interval cyclic edge-colorings are investigated. Also, we give some bounds for...

متن کامل

Negative results on acyclic improper colorings

Raspaud and Sopena showed that the oriented chromatic number of a graph with acyclic chromatic number k is at most k2. We prove that this bound is tight for k ≥ 3. We also consider acyclic improper colorings on planar graphs and partial ktrees. Finally, we show that some improper and/or acyclic colorings are NP-complete on restricted subclasses of planar graphs, in particular acyclic 3-colorabi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Graph Theory

دوره 82  شماره 

صفحات  -

تاریخ انتشار 2016